Multi-Tilde-Bar Derivatives

Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

Strong normalization of lambda-bar-mu-mu-tilde-calculus with explicit substitutions

Extended to multi-tilde-bar regular expressions and efficient finite automata constructions

Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton and Yamada, is based on the computation of the Null, First, Last and Follow sets (called Glushkov functions) associated with a linearized version of the expression. Recently Mignot considered a family of extended expr...

TILDE Trees in the UNIX Environment

ABSrRACf TILDE is a multi-year research project exploring distributed computing in an environment where the primary computing engine consists of a cluster of UNIX·liket systems loosely coupled with high-speed local area networks. The goal of 'IU.DE is to extend UNIX to provide a transparent integration of local and remote facilities, allowing the user access to remote files and services without...

Multi-relational data mining in Microsoft SQL

Most real life data are relational by nature. Database mining integration is an essential goal to be achieved. Microsoft SQL Server (MSSQL) seems to provide an interesting and promising environment to develop aggregated multi-relational data mining algorithms by using nested tables and the plug-in algorithm approach. However, it is currently unclear how these nested tables can best be used by d...